package org.news.web.utils;

import java.io.*;
import java.util.*;

/**
 *  敏感词过滤 关键字检测
 */
public class DFAutils {
    public static Map<String, Object> dictionaryMap = new HashMap<>();


    /**
     * 敏感词
     */
    static{
        /**
         * 构造生成敏感词库
         */
        try {
            StringBuilder result = new StringBuilder();
//            一行一行读取
            BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(new FileInputStream("C:\\Users\\Admin\\Desktop\\news-recommen-master\\mgck_23139\\key.txt")));
            String s = "";
//            读取数据
            while((s = bufferedReader.readLine()) != null){
                result.append(s);
            }
//             进行格式处理
            String dealStr = result.toString();
            dealStr = dealStr.replaceAll("\n","");

//            转换为集合
            String[] split = dealStr.split("\\|");
//            System.out.println(split[0]);
            System.out.println(Arrays.asList(split));
            initMap(Arrays.asList(split));
//            System.out.println(dictionaryMap);
//
        } catch (FileNotFoundException e) {
            throw new RuntimeException(e);
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }
    /**
     * 生成关键词字典库
     * @param words
     * @return
     */
    public static void initMap(Collection<String> words) {
        if (words == null) {
            System.out.println("敏感词列表不能为空");
            return ;
        }
        // map初始长度words.size()，整个字典库的入口字数(小于words.size()，因为不同的词可能会有相同的首字)
        Map<String, Object> map = new HashMap<>(words.size());
        // 遍历过程中当前层次的数据
        Map<String, Object> curMap = null;
        Iterator<String> iterator = words.iterator();
        while (iterator.hasNext()) {
            String word = iterator.next();
            curMap = map;
            int len = word.length();
            for (int i =0; i < len; i++) {
                // 遍历每个词的字
                String key = String.valueOf(word.charAt(i));
                // 当前字在当前层是否存在, 不存在则新建, 当前层数据指向下一个节点, 继续判断是否存在数据
                Map<String, Object> wordMap = (Map<String, Object>) curMap.get(key);
                if (wordMap == null) {
                    // 每个节点存在两个数据: 下一个节点和isEnd(是否结束标志)
                    wordMap = new HashMap<>(2);
                    wordMap.put("isEnd", "0");
                    curMap.put(key, wordMap);
                }
                curMap = wordMap;
                // 如果当前字是词的最后一个字，则将isEnd标志置1
                if (i == len -1) {
                    curMap.put("isEnd", "1");
                }
            }
        }

        dictionaryMap = map;
    }

    /**
     * 搜索文本中某个文字是否匹配关键词
     * @param text
     * @param beginIndex
     * @return
     */
    private static int checkWord(String text, int beginIndex) {
        if (dictionaryMap == null) {
            throw new RuntimeException("字典不能为空");
        }
        boolean isEnd = false;
        int wordLength = 0;
//        记录最近一次完整关键字的单词长度
        int tempWordLength = 0;
        Map<String, Object> curMap = dictionaryMap;
        int len = text.length();
        // 从文本的第beginIndex开始匹配
        for (int i = beginIndex; i < len; i++) {
            String key = String.valueOf(text.charAt(i));
            // 获取当前key的下一个节点
            curMap = (Map<String, Object>) curMap.get(key);
            /**
             *  todo 跳过 无意义字符
             */
            if (curMap == null) {
                break;
            } else {
                wordLength ++;
                if ("1".equals(curMap.get("isEnd"))) {
                    tempWordLength = wordLength;
                    isEnd = true;
                }else{
                    isEnd=false;
                }
            }
        }
        if (!isEnd) {
            wordLength = tempWordLength;
        }
        return wordLength;
    }
    /**
     * 获取匹配的关键词和命中次数
     * @param text
     * @return
     */
    public static Map<String, Integer> matchWords(String text) {
        Map<String, Integer> wordMap = new HashMap<>();
        int len = text.length();
        for (int i = 0; i < len; i++) {
            int wordLength = checkWord(text, i);
            if (wordLength > 0) {
                String word = text.substring(i, i + wordLength);
                // 添加关键词匹配次数
                if (wordMap.containsKey(word)) {
                    wordMap.put(word, wordMap.get(word) + 1);
                } else {
                    wordMap.put(word, 1);
                }
                i += wordLength - 1;
            }
        }
        return wordMap;
    }

    public static void main(String[] args) {
        Set<String> col = new HashSet<>();
//        System.out.println(dictionaryMap);
//        initMap(col);
        System.out.println(matchWords("黄se图片，3U娱乐城，冰钻石qq"));
    }

}
